|
|
Dynamic Programming in Graph Algorithms
Biloš, Martin ; Křivka, Zbyněk (referee) ; Burgetová, Ivana (advisor)
This work is about graph algorithms, their use and the benefit of the optimization method of dynamic programming. This benefit is show to the user via the graphic application. Graph algorithms find use in many sectors of human activity. They are used in packet routing or, for example, navigation. There are three methods of graph algorithms used in this work. This problems are solved with classic and dynamic way and measured data are compared.
|
|
|
Optimal Route Planning for Electric Vehicles
Juřík, Tomáš ; Franek, Lešek (referee) ; Fiedler, Petr (advisor)
In this work we present algorithms that are capable of calculating paths to destination for electric vehicles. These paths can be based on the simple metrics such as the distance, time or the paths can be based on more advanced metric such as the minimum energy demanding metric. This metric is parameterizable by the physical construction of the electrical vehicle. We also propose a new algorithm that computes energy optimal paths that are more acceptable by the driver, because it also takes into consideration the time metric while computing the path.
|
|
|
Application of neural networks in telecommunications
Šulák, Michal ; Koula, Ivan (referee) ; Kacálek, Jan (advisor)
This Master’s Thesis consists of description of current routing protocols and routers, basic principles of neural networks and their interpretation in connection with the use for routing in data networks and telecommunications networks. In the thesis I focused on neural networks, which use energetic functions to find solution stabled states and their use for data routing. I produced the application software to test and find suitable variables for each function. This application counts the shortest path and is able to change variables to reach the best solution of stabled state of neural network. These solutions are compared with other functions that are usually used in nowadays systems for data network routing.
|
|
|
Analysis and Prediction from GPS Data
Kováčik, Dušan ; Bartík, Vladimír (referee) ; Burget, Radek (advisor)
This paper deals with the analysis of the collected GPS data and the possibility of the prediction of most advantageous route on its basis, by the application written in the PHP scripting language. The suitability of the route is considered by the distance, driving time, or elevation. The thesis also describes a GPS system, the format of the source data and their storing in an appropriate database. There is also a description of the search of the shortest path in the graph and some famous algorithms for finding it. The paper includes information about implementation of new data integration and path finding within this data in PHP scripting language. In conclusion it is evaluated what are the benefits of this application and design saying how this application can be improved in the future.
|
|
| |
|
|
Route Planning in Air Transport
Sychra, Marek ; Krčmář, Radim (referee) ; Křivka, Zbyněk (advisor)
The problem of route planning in air transport (in public transport in general ) is similar to the shortest path problem. The main differences are the time dependency of the input graph and the multicriterial aspect of the path costs . The aim of this thesis was to create a complex system that would be able to load elementary flights from database and then respond to user requests with combined journeys made from single flights . It was achieved using two state of the art algorithms , CSA and RAPTOR , which were adapted for the flight graph. The experiments which were run on real world data showed massive speedup of the algorithms when using the proposed optimisations . The whole system was also tested against an existing proprietary solution .
|
|
|
Optimization of Warehouse Passing
Holáň, Jan ; Kožár, Tomáš (referee) ; Křivka, Zbyněk (advisor)
The work focuses on finding the shortest path through the warehouse in order to pick a given number of items. It describes the necessary theory related to mathematical problems related to the topic of this work. Most attention is given to a generally not much discussed topic, which is the grouping of indistinguishable groups of items, in order to obtain the resulting shortest path between items. The result is a C++ library capable of dealing with picking optimization under conditions defined by a specific real company.
|
|
|
Optimization problems with decision-dependent uncertainty
Šípka, Stanislav ; Branda, Martin (advisor) ; Lachout, Petr (referee)
In practical optimization problems, uncertainty in parameter values is often present. This uncertainty needs to be taken in account when taking real-life de- cisions. Such issues, where the parameters of the problem lie in the sets with a given shape, can be solved by a type of linear optimization called robust linear optimization. Special cases of these robust optimization are problems, where the sets depend on decisions. In this thesis we will focus on these special problems. The main aim of this thesis is to reformulate the classical form of the problems, leading to formulations which can be solved by standard computational software. We will then use these formulations in numerical study, focusing on behavior of robust shortest path in graphs. 1
|
|
|
Dynamic Programming in Graph Algorithms
Biloš, Martin ; Křivka, Zbyněk (referee) ; Burgetová, Ivana (advisor)
This work is about graph algorithms, their use and the benefit of the optimization method of dynamic programming. This benefit is show to the user via the graphic application. Graph algorithms find use in many sectors of human activity. They are used in packet routing or, for example, navigation. There are three methods of graph algorithms used in this work. This problems are solved with classic and dynamic way and measured data are compared.
|
|
|
Route Planning in Air Transport
Sychra, Marek ; Krčmář, Radim (referee) ; Křivka, Zbyněk (advisor)
The problem of route planning in air transport (in public transport in general ) is similar to the shortest path problem. The main differences are the time dependency of the input graph and the multicriterial aspect of the path costs . The aim of this thesis was to create a complex system that would be able to load elementary flights from database and then respond to user requests with combined journeys made from single flights . It was achieved using two state of the art algorithms , CSA and RAPTOR , which were adapted for the flight graph. The experiments which were run on real world data showed massive speedup of the algorithms when using the proposed optimisations . The whole system was also tested against an existing proprietary solution .
|
guest ::
